How Powerful Are Integer-Valued Martingales?

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

What are Rings of Integer-Valued Polynomials?

Every integer is either even or odd, so we know that the polynomial f(x) = x(x− 1) 2 is integervalued on the integers, even though its coefficients are not in Z. Similarly, since every binomial coefficient ( k n ) is an integer, the polynomial ( x n ) = x(x− 1)...(x− n+ 1) n! must also be integervalued. These polynomials were used for polynomial interpolation as far back as the 17 century. Inte...

متن کامل

How powerful are the DDH hard groups?

The question whether Identity-Based Encryption (IBE) can be based on the Decisional DiffieHellman (DDH) assumption is one of the most prominent questions in Cryptography related to DDH. We study limitations on the use of the DDH assumption in cryptographic constructions, and show that it is impossible to construct a secure Identity-Based Encryption system using, in a black box way, only the DDH...

متن کامل

Integer Valued AR(1) with Geometric Innovations

The classical integer valued first-order autoregressive (INA- R(1)) model has been defined on the basis of Poisson innovations. This model has Poisson marginal distribution and is suitable for modeling equidispersed count data. In this paper, we introduce an modification of the INAR(1) model with geometric innovations (INARG(1)) for model- ing overdispersed count data. We discuss some structu...

متن کامل

Integer-valued Polynomials

Let R be a Krull ring with quotient field K and a1, . . . , an in R. If and only if the ai are pairwise incongruent mod every height 1 prime ideal of infinite index in R does there exist for all values b1, . . . , bn in R an interpolating integer-valued polynomial, i.e., an f ∈ K[x] with f(ai) = bi and f(R) ⊆ R. If S is an infinite subring of a discrete valuation ring Rv with quotient field K a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of Computing Systems

سال: 2011

ISSN: 1432-4350,1433-0490

DOI: 10.1007/s00224-011-9362-3